Generalized Fibonacci and Lucas sequences and rootfinding methods
نویسندگان
چکیده
منابع مشابه
Some Identities for Generalized Fibonacci and Lucas Sequences
In this study, we define a generalization of Lucas sequence {pn}. Then we obtain Binet formula of sequence {pn} . Also, we investigate relationships between generalized Fibonacci and Lucas sequences.
متن کاملOn convolved generalized Fibonacci and Lucas polynomials
We define the convolved hðxÞ-Fibonacci polynomials as an extension of the classical con-volved Fibonacci numbers. Then we give some combinatorial formulas involving the hðxÞ-Fibonacci and hðxÞ-Lucas polynomials. Moreover we obtain the convolved hðxÞ-Fibo-nacci polynomials from a family of Hessenberg matrices. Fibonacci numbers and their generalizations have many interesting properties and appli...
متن کاملFibonacci and Lucas Sums by Matrix Methods
The Fibonacci sequence {Fn} is defined by the recurrence relation Fn = Fn−1+ Fn−2, for n ≥ 2 with F0 = 0 and F1 = 1. The Lucas sequence {Ln} , considered as a companion to Fibonacci sequence, is defined recursively by Ln = Ln−1 + Ln−2, for n ≥ 2 with L0 = 2 and L1 = 1. It is well known that F−n = (−1)Fn and L−n = (−1)Ln, for every n ∈ Z. For more detailed information see [9],[10]. This paper pr...
متن کاملOn generalized Lucas sequences
We introduce the notions of unsigned and signed generalized Lucas sequences and prove certain polynomial recurrence relations on their characteristic polynomials. We also characterize when these characteristic polynomials are irreducible polynomials over a finite field. Moreover, we obtain the explicit expressions of the remainders of Dickson polynomials of the first kind divided by the charact...
متن کاملGeneralized Fibonacci and Lucas Polynomials and Their Associated Diagonal Polynomials
Horadam [7], in a recent article, defined two sequences of polynomials Jn(x) and j„(x), the Jacobsthal and Jacobsthal-Lucas polynomials, respectively, and studied their properties. In the same article, he also defined and studied the properties of the rising and descending polynomials i^(x), rn(x), Dn(x)y and dn(x), which are fashioned in a manner similar to those for Chebyshev, Fermat, and oth...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics of Computation
سال: 1993
ISSN: 0025-5718
DOI: 10.1090/s0025-5718-1993-1192974-3